Successive Mappings: An Approach to Polygonal Mesh Simplification with Guaranteed Error Bounds

نویسندگان

  • Jonathan D. Cohen
  • Dinesh Manocha
  • Marc Olano
چکیده

We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function for each simplification operation and use this function to measure deviation of the new surface from both the previous level of detail and from the original surface. In addition, we use the mapping function to compute appropriate texture coordinates if the original model has texture coordinates at its vertices. Our overall algorithm uses edge collapse operations. We present rigorous procedures for the generation of local orthogonal projections to the plane as well as for the selection of a new vertex position resulting from the edge collapse operation. The algorithm computes guaranteed error bounds on surface deviation and produces an entire continuum of levels of detail with mappings between them. We demonstrate the effectiveness of our algorithm on several models: a Ford Bronco consisting of over 300 parts and 70; 000 triangles, a textured lion model consisting of 49 parts and 86; 000 triangles, a textured, wrinkled torus consisting of 79; 000 triangles, a dragon model consisting of 871; 000 triangles, a Buddha model consisting of 1,000,000 triangles, and an armadillo model consisting of 2; 000; 000 triangles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tsallis Entropy for Geometry Simplification

This paper presents a study and a comparison of the use of different information-theoretic measures for polygonal mesh simplification. Generalized measures from Information Theory such as Havrda–Charvát–Tsallis entropy and mutual information have been applied. These measures have been used in the error metric of a surface simplification algorithm. We demonstrate that these measures are useful f...

متن کامل

On Exact Error Bounds for View-Dependent Simplification

In this article we present an analytical closed-form expression to ensure exact error bounds for view-dependent simplification which is of importance for several algorithms. The present work contains proofs and solutions for the general 2D case and particular 3D cases. Most preceeding works rely on coarse heuristics, that might fail and/or restrict movements or object representations. We introd...

متن کامل

Polygonal Mesh Simplification with Face Color and Boundary Edge Preservation Using Quadric Error Metric

In the applications such as scientific and medical visualization, highly detailed polygonal meshes are needed. Rendering these polygonal meshes usually exceeds the capabilities of graphics hardware. To improve rendering efficiency and maintain proper interactivity, the polygonal mesh simplification technique is commonly used to reduce the number of polygons of the mesh and to construct the mult...

متن کامل

PAT: A pattern classification approach to automatic reference oracles for the testing of mesh simplification programs

Graphics applications often need to manipulate numerous graphical objects stored as polygonal models. Mesh simplification is an approach to vary the levels of visual details as appropriate, thereby improving on the overall performance of the applications. Different mesh simplification algorithms may cater for different needs, producing diversified types of simplified polygonal model as a result...

متن کامل

Mesh Simplification Using Distance Labels for View-Independent Silhouette Preservation

Multiresolution modelling is a good method to achieve both quality and performance in the rendering of complex scenes. Within this framework, the detection and preservation of outstanding features, such us silhouettes, become very important. The goal of this paper is to present a technique based on Distance Transforms that allows to classify the elements of the mesh according to their proximity...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Comput. Geometry Appl.

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2003